Network Design Foundation Homework 2 - Solution

نویسنده

  • Mohammad T. Hajiaghayi
چکیده

1. • Let T = (V, E) be a tree and let D =< d1, . . . , dk > denote the set of demands. We reduce the prize-collecting steiner forest problem on trees to the minimum weighted vertex cover problem. We make a bipartite graph H = (V ′, E ′) where for each edge e ∈ E we put a vertex pe in V ′ and also for every di ∈ D we put a vertex qi in V ′. We put an edge between pe and qi iff the edge e is on the unique path between the endpoints of demand di in T . The weight of pe would be the length of e and the weight of qi would be the prize of di. Recall that a vertex cover is a subset S of vertices which every edge has at least an endpoint in S. One can easily show that the cost of the minimum vertex cover in H is equal to the cost of the minimum steiner forest in T . We note that for any vertex qi, we have to include qi in our vertex cover unless we have chosen all the pe s adjacent to qi which essentially means that we have chosen all the edges in the path between the endpoints of di. Vertex cover can be modeled as a set cover problem where the frequency of each member is two, and thus it has a 2-approximation algorithm (consider the edges as elements and the vertices as sets). However since H here is a bipartite graph there is a polynomial time exact algorithm based on primal-dual ideas. • For general graphs, we simply embed the graph into a collection of trees, paying at most a factor of O(logn) on distances and thus on the approximation ratio. Then we solve the problem on trees with the 2-approximation algorithm (or the exact algorithm) described above.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Analytical Solution for Determination of Acceptable Overall settlement of Heap Leaching Structures Foundation

There are some artificial and natural materials on foundation of heap leaching structures. Geomembrane liner is the most important artificial isolated layer of these structures. The thickness of this layer is about 1 to 2 mm. Foundation overall settlement of such structures changes the primary length of the geomembrane layer. If the strain of geomembrane is more than allowable one, the layer wi...

متن کامل

COMS 4771 : Homework 2 Solution

f(x) = { 1 if wx+ b > 0, −1 otherwise. Consider d+1 points x = (0, ..., 0) , x = (1, 0, ..., 0) , x = (0, 1, ..., 0) , ..., x = (0, 0, ..., 1) . After these d+1 points being arbitrarily labeled: y = (y0, y1, ..., yd) T ∈ {−1, 1}. Let b = 0.5 · y0 and w = (w1, w2, ...wd) where wi = yi, i ∈ {1, 2, ..., d}. Thus f(x) can label all these d+ 1 points correctly. So the VC dimension of perceptron is a...

متن کامل

Prediction of Patient’s Response to Cognitive-Behavior Therapy by Artificial Neural Network

Objective: Social anxiety disorder (SAD) is defined as a constant fear of being embarrassed or negatively evaluated in social situations or while doing activities in the presence of others. Several studies have examined the role of certain variables that might predict response to treatment and may affect treatment outcome. The purpose of this study was to identify predictive variables of change...

متن کامل

A simulated annealing approach to solve the network design of one-way streets: case of Shiraz network

This study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (SA) algorithm to solve this problem for a large real network. It discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015